Zoom-in-Net: Deep Mining Lesions for Diabetic Retinopathy Detection

We propose a convolution neural network based algorithm for simultaneously diagnosing diabetic retinopathy and highlighting suspicious regions. Our contributions are two folds: 1) a network termed Zoom-in-Net which mimics the zoom-in process of a clinician to examine the retinal images. Trained with only image-level supervisions, Zoomin-Net can generate attention maps which highlight suspicious regions, and predicts the disease level accurately based on both the whole image and its high resolution suspicious patches. 2) Only four bounding boxes generated from the automatically learned attention maps are enough to cover 80% of the lesions labeled by an experienced ophthalmologist, which shows good localization ability of the attention maps. By clustering features at high response locations on the attention maps, we discover meaningful clusters which contain potential lesions in diabetic retinopathy. Experiments show that our algorithm outperform the state-of-the-art methods on two datasets, EyePACS and Messidor.Comment: accepted by MICCAI 201

Selective labeling: identifying representative sub-volumes for interactive segmentation

Automatic segmentation of challenging biomedical volumes with multiple objects is still an open research field. Automatic approaches usually require a large amount of training data to be able to model the complex and often noisy appearance and structure of biological organelles and their boundaries. However, due to the variety of different biological specimens and the large volume sizes of the datasets, training data is costly to produce, error prone and sparsely available. Here, we propose a novel Selective Labeling algorithm to overcome these challenges; an unsupervised sub-volume proposal method that identifies the most representative regions of a volume. This massively-reduced subset of regions are then manually labeled and combined with an active learning procedure to fully segment the volume. Results on a publicly available EM dataset demonstrate the quality of our approach by achieving equivalent segmentation accuracy with only 5 % of the training data

Probabilistic Graphs for Sensor Data-driven Modelling of Power Systems at Scale

The growing complexity of the power grid, driven by increasing share of distributed energy resources and by massive deployment of intelligent internet-connected devices, requires new modelling tools for planning and operation. Physics-based state estimation models currently used for data filtering, prediction and anomaly detection are hard to maintain and adapt to the ever-changing complex dynamics of the power system. A data-driven approach based on probabilistic graphs is proposed, where custom non-linear, localised models of the joint density of subset of system variables can be combined to model arbitrarily large and complex systems. The graphical model allows to naturally embed domain knowledge in the form of variables dependency structure or local quantitative relationships. A specific instance where neural-network models are used to represent the local joint densities is proposed, although the methodology generalises to other model classes. Accuracy and scalability are evaluated on a large-scale data set representative of the European transmission grid

Robust detection of communities with multi-semantics in large attributed networks

© 2018, Springer Nature Switzerland AG. In this paper, we are interested in how to explore and utilize the relationship between network communities and semantic topics in order to find the strong explanatory communities robustly. First, the relationship between communities and topics displays different situations. For example, from the viewpoint of semantic mapping, their relationship can be one-to-one, one-to-many or many-to-one. But from the standpoint of underlying community structures, the relationship can be consistent, partially consistent or completely inconsistent. Second, it will be helpful to not only find communities more precise but also reveal the communities’ semantics that shows the relationship between communities and topics. To better describe this relationship, we introduce the transition probability which is an important concept in Markov chain into a well-designed nonnegative matrix factorization framework. This new transition probability matrix with a suitable prior which plays the role of depicting the relationship between communities and topics can perform well in this task. To illustrate the effectiveness of the proposed new approach, we conduct some experiments on both synthetic and real networks. The results show that our new method is superior to baselines in accuracy. We finally conduct a case study analysis to validate the new method’s strong interpretability to detected communities

Markov clustering versus affinity propagation for the partitioning of protein interaction graphs

<p>Abstract</p> <p>Background</p> <p>Genome scale data on protein interactions are generally represented as large networks, or graphs, where hundreds or thousands of proteins are linked to one another. Since proteins tend to function in groups, or complexes, an important goal has been to reliably identify protein complexes from these graphs. This task is commonly executed using clustering procedures, which aim at detecting densely connected regions within the interaction graphs. There exists a wealth of clustering algorithms, some of which have been applied to this problem. One of the most successful clustering procedures in this context has been the Markov Cluster algorithm (MCL), which was recently shown to outperform a number of other procedures, some of which were specifically designed for partitioning protein interactions graphs. A novel promising clustering procedure termed Affinity Propagation (AP) was recently shown to be particularly effective, and much faster than other methods for a variety of problems, but has not yet been applied to partition protein interaction graphs.</p> <p>Results</p> <p>In this work we compare the performance of the Affinity Propagation (AP) and Markov Clustering (MCL) procedures. To this end we derive an unweighted network of protein-protein interactions from a set of 408 protein complexes from <it>S. cervisiae </it>hand curated in-house, and evaluate the performance of the two clustering algorithms in recalling the annotated complexes. In doing so the parameter space of each algorithm is sampled in order to select optimal values for these parameters, and the robustness of the algorithms is assessed by quantifying the level of complex recall as interactions are randomly added or removed to the network to simulate noise. To evaluate the performance on a weighted protein interaction graph, we also apply the two algorithms to the consolidated protein interaction network of <it>S. cerevisiae</it>, derived from genome scale purification experiments and to versions of this network in which varying proportions of the links have been randomly shuffled.</p> <p>Conclusion</p> <p>Our analysis shows that the MCL procedure is significantly more tolerant to noise and behaves more robustly than the AP algorithm. The advantage of MCL over AP is dramatic for unweighted protein interaction graphs, as AP displays severe convergence problems on the majority of the unweighted graph versions that we tested, whereas MCL continues to identify meaningful clusters, albeit fewer of them, as the level of noise in the graph increases. MCL thus remains the method of choice for identifying protein complexes from binary interaction networks.</p

Structured frameworks to increase the transparency of the assessment of benefits and risks of medicines: current status and possible future directions

Structured frameworks for benefit-risk analysis in drug licensing decisions are being implemented across a number of regulatory agencies worldwide. The aim of these frameworks is to aid the analysis and communication of the benefit-risk assessment throughout the development, evaluation, and supervision of medicines. In this review, authors from regulatory agencies, pharmaceutical companies, and academia share their views on the different frameworks and discuss future directions

Evidence from GC-TRFLP that Bacterial Communities in Soil Are Lognormally Distributed

The Species Abundance Distribution (SAD) is a fundamental property of ecological communities and the form and formation of SADs have been examined for a wide range of communities including those of microorganisms. Progress in understanding microbial SADs, however, has been limited by the remarkable diversity and vast size of microbial communities. As a result, few microbial systems have been sampled with sufficient depth to generate reliable estimates of the community SAD. We have used a novel approach to characterize the SAD of bacterial communities by coupling genomic DNA fractionation with analysis of terminal restriction fragment length polymorphisms (GC-TRFLP). Examination of a soil microbial community through GC-TRFLP revealed 731 bacterial operational taxonomic units (OTUs) that followed a lognormal distribution. To recover the same 731 OTUs through analysis of DNA sequence data is estimated to require analysis of 86,264 16S rRNA sequences. The approach is examined and validated through construction and analysis of simulated microbial communities in silico. Additional simulations performed to assess the potential effects of PCR bias show that biased amplification can cause a community whose distribution follows a power-law function to appear lognormally distributed. We also show that TRFLP analysis, in contrast to GC-TRFLP, is not able to effectively distinguish between competing SAD models. Our analysis supports use of the lognormal as the null distribution for studying the SAD of bacterial communities as for plant and animal communities

The evolution of acoustic size exaggeration in terrestrial mammals

Recent studies have revealed that some mammals possess adaptations that enable them to produce vocal signals with much lower fundamental frequency (F0) and formant frequency spacing (ΔF) than expected for their size. Although these adaptations are assumed to reflect selection pressures for males to lower frequency components and exaggerate body size in reproductive contexts, this hypothesis has not been tested across a broad range of species. Here we show that male terrestrial mammals produce vocal signals with lower ΔF (but not F0) than expected for their size in mating systems with greater sexual size dimorphism. We also reveal that males produce calls with higher than expected F0 and ΔF in species with increased sperm competition. This investigation confirms that sexual selection favours the use of ΔF as an acoustic size exaggerator, and supports the notion of an evolutionary trade-off between pre-copulatory signalling displays and sperm production

Nucleocytoplasmic transport: a thermodynamic mechanism

The nuclear pore supports molecular communication between cytoplasm and nucleus in eukaryotic cells. Selective transport of proteins is mediated by soluble receptors, whose regulation by the small GTPase Ran leads to cargo accumulation in, or depletion from the nucleus, i.e., nuclear import or nuclear export. We consider the operation of this transport system by a combined analytical and experimental approach. Provocative predictions of a simple model were tested using cell-free nuclei reconstituted in Xenopus egg extract, a system well suited to quantitative studies. We found that accumulation capacity is limited, so that introduction of one import cargo leads to egress of another. Clearly, the pore per se does not determine transport directionality. Moreover, different cargo reach a similar ratio of nuclear to cytoplasmic concentration in steady-state. The model shows that this ratio should in fact be independent of the receptor-cargo affinity, though kinetics may be strongly influenced. Numerical conservation of the system components highlights a conflict between the observations and the popular concept of transport cycles. We suggest that chemical partitioning provides a framework to understand the capacity to generate concentration gradients by equilibration of the receptor-cargo intermediary.Comment: in press at HFSP Journal, vol 3 16 text pages, 1 table, 4 figures, plus Supplementary Material include